Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Data Structure | Sorting Algorithms| DSA Full Course
•

What is the Merge sort algorithm?

• The Merge sort algorithm is a divide and conquer algorithm which
sorts an array or list by dividing it into two halves, sorting them
separately and then merging them back together
...
It takes two subarrays and merges them into a sorted array
...
Initially, we set two pointers i and j to the beginning of each
subarray and a pointer k to the beginning of the merged array
...
Compare the values of a[i] and a[j]
...
Otherwise, put
a[j] in the merged array and increment j
...
Repeat step 2 until we have i less than or equal to mid and j less
than or equal to upper bound
...
If j is greater than the upper bound, then put all the remaining
elements of the second subarray into the merged array
...
If i is greater than the mid, then put all the remaining elements of
the first subarray into the merged array
...

• What is merge sort?
• Merge sort is a sorting algorithm where the given list is divided into
two halves recursively until one or zero elements are left in the
sublists
...
This process is repeated until the entire list is sorted
...
The
merging process involves comparing the first elements of the
sublists, taking the smaller element, and adding it to th e new sublist
...
The remaining elements of the
other sublist are then added to the new sublist
...
The recursive tree for merge sort is a visual representation of
how the list is divided into sublists and merged back together
...




---